A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Ramesh Babu, I.
- Maximizing the Channel Throughput in Mobile Ad Hoc Networks Using mIDS
Authors
1 Department of Computer Science and Engineering, P. V. P. Siddhartha Institute of Technology, affiliated to Jawaharlal Nehru Technological University, IN
2 Department of Computer Science, Nagarjuna University, IN
Source
Wireless Communication, Vol 1, No 6 (2009), Pagination: 257-264Abstract
Maximizing the channel throughput capacity and providing security for nodes in the mobile adhoc networks is becoming an attractive challenge for many researchers today. The nodes in the mobile adhoc networks move from one region to another. But still they demand for the security for their transactions. Today’s firewalls and encryption software’s are not sufficient and effective to protect the networks. An intrusion detection system (IDS) is required to monitor the network, detect the misbehaviors or anomalies and notify other nodes in the network to avoid or punish the misbehaving nodes. Because of these misbehaving nodes the network performance degrades. Hence a method is proposed to identify and control the misbehaving nodes so as identify the misbehaving nodes, and control their behavior. This ultimately improves the channel throughput. We proposed a new mIDS (Mobile Intrusion Detection System) suitable for multi-hop ad-hoc wireless networks in [2][4][5][6][7] which detects nodes misbehavior, anomalies in packet forwarding, such as intermediate nodes dropping or delaying packets. mIDS does relay on overhearing packet transmissions of neighboring nodes. In [8][9][10] we proposed a new scheduling method which improves the channel efficiency and network capacity.
In this paper we evaluated the metrics like
1. Packet dropping
2. Minimize the Control packet overhead on the nodes
3. Maximize the Channel throughput
in mobile adhoc networks using the mIDS protocol.
Keywords
CDMA, Dos, IDS, mIDS, QoS, TDMA.- Modified Heuristic Time Deviation Technique for Job Sequencing and Computation of Minimum Total Elapsed Time
Authors
1 Department of C S & E, R.V.R & J. C. College of Engineering, Guntur, A. P., IN
2 Department of Computer Science and Engineering, Nagarjuna University, Guntur, Andhra Pradesh, IN
Source
AIRCC's International Journal of Computer Science and Information Technology, Vol 5, No 3 (2013), Pagination: 67-77Abstract
Job sequencing is the arrangement of the task that is to be performed or processed in a machine in that particular order. Job sequencing problem has become the major problem in the computer field. A finite set of n jobs where each job consists of a chain of operations and a finite set of m machines where each machine can handle at most one operation at a time. Each operation needs to be processed during an uninterrupted period of a given length on a given machine and our Purpose is to find a schedule, that is, an allocation of the operations to time intervals to machines that has minimal length.Keywords
Job Sequencing, Processing Time, Schedule, Non-Preemptive, Preemptive, Time Deviation, Time Duration, Total Elapsed Time, Heuristic Technique, Sequencing Rules, Earliest Due Date, Shortest Processing Time Rule.- Network Intrusion Detection Using FP Tree Rules
Authors
1 Department of Computer Science and Engineering, V R Siddhartha Engineering College, Vijayawada, IN
2 Department of Computer Science and Engineering, Acharya Nagarjuna University, Guntur, IN